A high-performance analog Max-SAT solver and its application to Ramsey numbers
نویسندگان
چکیده
Botond Molnár, 2 Melinda Varga, 4 Zoltán Toroczkai, ∗ and Mária Ercsey-Ravasz 2, 5, † 1Faculty of Physics, Babeş-Bolyai University, Cluj-Napoca, 400084 Romania 2Romanian Institute of Science and Technology, Cluj-Napoca, 400487 Romania 3Department of Physics and the Interdisciplinary Center for Network Science and Applications, University of Notre Dame, Notre Dame, IN, 46556 USA 4Biochemistry and Molecular Biology Program, The College of Wooster, Wooster, OH, 44691 USA 5Transylvanian Institute of Neuroscience, Cluj-Napoca, 400157 Romania (Dated: January 30, 2018)
منابع مشابه
Green-Tao Numbers and SAT
We consider the links between Ramsey theory in the integers, based on van der Waerden’s theorem, and (boolean, CNF) SAT solving. We aim at using the problems from exact Ramsey theory, concerned with computing Ramsey-type numbers, as a rich source of test problems, where especially methods for solving hard problems can be developed. We start our investigations here by reviewing the known van der...
متن کاملMiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized by a cost as in Max-SAT) as well as pseudo-boolean objective functions and constraints. Its main features are: learning and backjumping on hard clauses; ...
متن کاملExploring Constraint Satisfiability Techniques in Formal Verification
Due to the widespread demands for efficient Propositional Satisfiability (SAT) solvers and its derivatives in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. This dissertation aims to enhance the performance of SAT and related SAT solving problems. A hybrid solution to boost SAT solver performance is proposed as an initial attack...
متن کاملSugar++: A SAT-Based MAX-CSP/COP Solver
This paper briefly describes some features of Sugar++, a SAT-based MAXCSP/COP solver entering the Third International CSP Solver Competition. In our approach, a MAX-CSP is translated into a Constraint Optimization Problem (COP), and then it is encoded into a SAT problem by the order encoding method [1]. SAT-encoded COP can be efficiently solved by repeatedly using the MiniSat solver [2]. The or...
متن کاملImproved Exact Solver for the Weighted MAX-SAT Problem
Many exact Max-SAT solvers use a branch and bound algorithm, where the lower bound is calculated with a combination of Max-SAT resolution and detection of disjoint inconsistent subformulas. We propose a propagation algorithm which improves the detection of disjoint inconsistent subformulas compared to algorithms previously used in Max-SAT solvers. We implemented this algorithm in our new solver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.06620 شماره
صفحات -
تاریخ انتشار 2018